home *** CD-ROM | disk | FTP | other *** search
- Path: anvil.ugrad.cs.ubc.ca!not-for-mail
- From: c2a192@ugrad.cs.ubc.ca (Kazimir Kylheku)
- Newsgroups: comp.lang.c
- Subject: Re: binary tree question
- Date: 25 Mar 1996 11:21:45 -0800
- Organization: Computer Science, University of B.C., Vancouver, B.C., Canada
- Message-ID: <4j6ro9INNgnm@anvil.ugrad.cs.ubc.ca>
- References: <4isglj$cgg@netaxs.com> <4ivpff$a6j@netaxs.com> <4j6fjjINNc2p@keats.ugrad.cs.ubc.ca> <3156E113.34B0@oc.com>
- NNTP-Posting-Host: anvil.ugrad.cs.ubc.ca
-
- In article <3156E113.34B0@oc.com>, Larry Weiss <lfw@oc.com> wrote:
- >Kazimir Kylheku wrote:
- > >
- > >
- > > Have a look at K&R2, section 8.7 Example---A Storage Allocator. It shows a
- > > simple C implementation of malloc() and free(). N.B.: you cannot write your own
- > > function called malloc() as the book suggests, for it is a reserved symbol
- > > according to ANSI. The book is wrong in this respect.
- > >
- >
- >Should that fact be mentioned in an errata for K&R2 ?
-
- Of course.
-
- One book with errata is bad enough!
- --
-
-